Spectral Bounds for Polydiagonal Jacobi Matrix Operators
نویسندگان
چکیده
منابع مشابه
Inverse spectral analysis for finite matrix-valued Jacobi operators
Consider the Jacobi operators J given by (J y)n = anyn+1+bnyn+a∗n−1yn−1, yn ∈ C (here y0 = yp+1 = 0), where bn = b ∗ n and an : det an 6= 0 are the sequences of m × m matrices, n = 1, .., p. We study two cases: (i) an = a∗n > 0; (ii) an is a lower triangular matrix with real positive entries on the diagonal (the matrix J is (2m+1)-band mp×mp matrix with positive entries on the first and the las...
متن کاملSpectral Deformations of Jacobi Operators
We extend recent work concerning isospectral deformations for one-dimensional Schrödinger operators to the case of Jacobi operators. We provide a complete spectral characterization of a new method that constructs isospectral deformations of a given Jacobi operator (Hu)(n) = a(n)u(n + 1) + a(n − 1)u(n − 1) − b(n)u(n). Our technique is connected to Dirichlet data, that is, the spectrum of the ope...
متن کاملSpectral perturbation bounds for selfadjoint operators I∗
We give general spectral and eigenvalue perturbation bounds for a selfadjoint operator perturbed in the sense of the pseudo-Friedrichs extension. We also give several generalisations of the aforementioned extension. The spectral bounds for finite eigenvalues are obtained by using analyticity and monotonicity properties (rather than variational principles) and they are general enough to include ...
متن کاملTrace Formulas and Inverse Spectral Theory for Jacobi Operators
Based on high energy expansions and Herglotz properties of Green and Weyl m-functions we develop a self-contained theory of trace formulas for Jacobi operators. In addition, we consider connections with inverse spectral theory, in particular uniqueness results. As an application we work out a new approach to the inverse spectral problem of a class of reflectionless operators producing explicit ...
متن کاملSome spectral bounds for the harmonic matrix
The aim of this note is to establish new spectral bounds for the harmonic matrix. The Harary matrix of given a connected graph G of order n, say RD(G), is an n-by-n symmetric matrix, such that (RD(G))ij = 1 dij , if i < j, 0 , if i = j, where dij denotes the distance between the vertices i and j [10, 11]. This matrix (originally known as reciprocal distance matrix [11]) is particulary well-k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Partial Differential Equations
سال: 2014
ISSN: 2356-7082,2314-6524
DOI: 10.1155/2014/920695